Mutually Exclusive Rules in LogicWeb
نویسندگان
چکیده
LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form D0&D1 where D0,D1 are Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – pv(D0&D1, G) – has the following operational semantics: choose a successful one between pv(D0, G) and pv(D1, G). In other words, if Do is chosen in the course of solving G, then D1 will be discarded and vice versa. Hence, the class of choice-conjunctive clauses precisely captures the notion of mutually exclusive clauses.
منابع مشابه
Secure Prolog Based Mobile Code
LogicWeb mobile code consists of Prolog-like rules embedded in Web pages, thereby adding logic programming behaviour to those pages. Since LogicWeb programs are downloaded from foreign hosts and executed locally, there is a need to protect the client from buggy or malicious code. A security model is crucial for making LogicWeb mobile code safe to execute. This paper presents such a model, which...
متن کاملMutually Exclusive Rules in Logic Programming
A technique to detect that pairs of rules are \mutually exclusive" in a logic program is described. In contrast to previous work our algorithm derives mutual exclusion by looking not only on built-in, but also user-de ned predicates. This technique has applications to optimization of the execution of programs containing these rules. Additionally, the programmer is less dependent on non-logical ...
متن کاملLogicWeb: Enhancing the Web with Logic Programming
LogicWeb is a client-side logic programming tool for the World Wide Web, which allows the Web to be viewed in a more abstract way: Web pages can be rephrased as logic programming modules, and hypertext links as relationships between the modules. This abstraction makes LogicWeb particularly suitable for coding important classes of applications, and this paper considers two in some detail: Web se...
متن کاملMutally Exclusive Rules in Logic Programming
A technique to detect that pairs of rules are “mutually exclusive” in a logic program is described. In contrast to previous work our algorithm derives mutual exclusion by looking not only on built-in, but also user-defined predicates. This technique has applications to optimization of the execution of programs containing these rules. Additionally, the programmer is less dependent on non-logical...
متن کاملOn the Discovery of Mutually Exclusive Items in a Market Basket Database
Mining a transaction database for association rules is a particularly popular data mining task, which involves the search for frequent co-occurrences among items. One of the problems often encountered is the large number of weak rules extracted. Item taxonomies, when available, can be used to reduce them to a more usable volume. In this paper we introduce a new data mining paradigm, which invol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1211.4935 شماره
صفحات -
تاریخ انتشار 2012